There exists no Steiner system S(4, 5, 17)
نویسندگان
چکیده
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S(4, 5, 17) is carried out. The search shows that no S(4, 5, 17) exists, thereby ruling out the existence of Steiner systems S(t, t+ 1, t+ 13) for t ≥ 4.
منابع مشابه
A Steiner 5-Design on 36 Points
All known Steiner 5-designs previously had an order q + 1 where q 3 (mod 4) is a prime power and PSL(2; q) was admitted as a group of automorphisms of such a design. In this paper we present a 5-(36; 6; 1) design admitting PGL(2; 17) C 2 as a group of automorphisms. The design is unique with this automorphism group and even for the commutator group PSL(2; 17) id 2 of this automorphism group the...
متن کامل5-sparse Steiner Triple Systems of Order n Exist for Almost All Admissible n
Steiner triple systems are known to exist for orders n ≡ 1, 3 mod 6, the admissible orders. There are many known constructions for infinite classes of Steiner triple systems. However, Steiner triple systems that lack prescribed configurations are harder to find. This paper gives a proof that the spectrum of orders of 5-sparse Steiner triple systems has arithmetic density 1 as compared to the ad...
متن کاملThe Nonexistence of a Certain Steiner System
Although the automorphism group of a projective plane of order 10, if one exists, must be very small, such a plane could be the derived design of a Steiner system S(3, 12, 112) with a larger group. There are several reasons why the Frobenius group of order 56 is a promising candidate for the latter group. However, in this paper it is shown that there is no S(3, 12, 112) which is fixed by this F...
متن کاملLecture 12 : Steiner Tree Problems
Last time we saw the construction of Halperin and Krauthgamer [5] that reduces Label-Cover to Group Steiner Tree, proving Ω(log2− k)-hardness. In particular, suppose that we are given an instance G of Label-Cover, and the HK reduction results in an instance T of Group Steiner Tree. They show that if OPT(G) = 1 then OPT(T ) = H , while if OPT(G) < η then OPT(T ) = Ω(H log k). Note that there is ...
متن کاملFurther results on the existence of generalized Steiner triple systems with group size g≡1, 5(mod 6)
Generalized Steiner triple systems, GS(2, 3, n, g) are equivalent to maximum constant weight codes over an alphabet of size g + 1 with distance 3 and weight 3 in which each codeword has length n. The necessary conditions for the existence of a GS(2, 3, n, g) are (n − 1)g ≡ 0 (mod 2), n(n − 1)g ≡ 0 (mod 6), and n ≥ g + 2. Recently, we proved that for any given g, g ≡ 1, 5 (mod 6) and g ≥ 11, if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 115 شماره
صفحات -
تاریخ انتشار 2008